<html>
 <head>
  <link href="./leetcode-problem.css" rel="stylesheet" type="text/css">
 </head>
 <body>
  <div class="question_difficulty">
   难度：Easy
  </div>
  <div>
   <h1 class="question_title">
    205. Isomorphic Strings
   </h1>
   <p>
    Given two strings
    <b>
     <i>
      s
     </i>
    </b>
    and
    <b>
     <i>
      t
     </i>
    </b>
    , determine if they are isomorphic.
   </p>
   <p>
    Two strings are isomorphic if the characters in
    <b>
     <i>
      s
     </i>
    </b>
    can be replaced to get
    <b>
     <i>
      t
     </i>
    </b>
    .
   </p>
   <p>
    All occurrences of a character must be replaced with another character while preserving the order of characters. No two characters may map to the same character but a character may map to itself.
   </p>
   <p>
    <strong>
     Example 1:
    </strong>
   </p>
   <pre>
<strong>Input:</strong> <b><i>s</i></b> = <code>"egg", </code><b><i>t = </i></b><code>"add"</code>
<strong>Output:</strong> true
</pre>
   <p>
    <strong>
     Example 2:
    </strong>
   </p>
   <pre>
<strong>Input:</strong> <b><i>s</i></b> = <code>"foo", </code><b><i>t = </i></b><code>"bar"</code>
<strong>Output:</strong> false</pre>
   <p>
    <strong>
     Example 3:
    </strong>
   </p>
   <pre>
<strong>Input:</strong> <b><i>s</i></b> = <code>"paper", </code><b><i>t = </i></b><code>"title"</code>
<strong>Output:</strong> true</pre>
   <p>
    <b>
     Note:
    </b>
    <br>
    You may assume both
    <b>
     <i>
      s&nbsp;
     </i>
    </b>
    and
    <b>
     <i>
      t&nbsp;
     </i>
    </b>
    have the same length.
   </p>
  </div>
  <div>
   <h1 class="question_title">
    205. 同构字符串
   </h1>
   <p>
    给定两个字符串&nbsp;
    <em>
     <strong>
      s&nbsp;
     </strong>
    </em>
    和&nbsp;
    <strong>
     <em>
      t
     </em>
    </strong>
    ，判断它们是否是同构的。
   </p>
   <p>
    如果&nbsp;
    <em>
     <strong>
      s&nbsp;
     </strong>
    </em>
    中的字符可以被替换得到&nbsp;
    <strong>
     <em>
      t&nbsp;
     </em>
    </strong>
    ，那么这两个字符串是同构的。
   </p>
   <p>
    所有出现的字符都必须用另一个字符替换，同时保留字符的顺序。两个字符不能映射到同一个字符上，但字符可以映射自己本身。
   </p>
   <p>
    <strong>
     示例 1:
    </strong>
   </p>
   <pre><strong>输入:</strong> <strong><em>s</em></strong> = <code>"egg", </code><strong><em>t = </em></strong><code>"add"</code>
<strong>输出:</strong> true
</pre>
   <p>
    <strong>
     示例 2:
    </strong>
   </p>
   <pre><strong>输入:</strong> <strong><em>s</em></strong> = <code>"foo", </code><strong><em>t = </em></strong><code>"bar"</code>
<strong>输出:</strong> false</pre>
   <p>
    <strong>
     示例 3:
    </strong>
   </p>
   <pre><strong>输入:</strong> <strong><em>s</em></strong> = <code>"paper", </code><strong><em>t = </em></strong><code>"title"</code>
<strong>输出:</strong> true</pre>
   <p>
    <strong>
     说明:
    </strong>
    <br>
    你可以假设&nbsp;
    <em>
     <strong>
      s&nbsp;
     </strong>
    </em>
    和
    <strong>
     <em>
      t
     </em>
    </strong>
    具有相同的长度。
   </p>
  </div>
 </body>
</html>